Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
نویسندگان
چکیده
منابع مشابه
Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus.
متن کاملOn the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
متن کاملA call-by-name lambda-calculus machine
We present, in this paper, a particularly simple lazy machine which runs programs written in λ-calculus. It was introduced by the present writer more than twenty years ago. It has been, since, used and implemented by several authors, but remained unpublished. In the first section, we give a rather informal, but complete, description of the machine. In the second part, definitions are formalized...
متن کاملCall-by-Name, Call-by-Value and the lambda-Calculus
This paper examines the old question of the relationship between ISWIM and the &calculus, using the distinction between call-by-value and call-by-name. It is held that the relationship should be mediated by a standardisation theorem. :3ince this leads to difficulties, a new &calcu%~s is introduced whose standardisation theorem gives a good correspondence with ISWIM a-; given by the SECT machine...
متن کاملCall-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus
To appear in Theoretical Computer Science, special issue on papers presented at MFPS’95. J. Maraist a, M. Odersky a, D.N. Turner b and P. Wadler c a School of Computer and Information Science, University of South Australia, Warrendi Road, The Levels, South Australia 5095, Australia. Email, fmaraist,[email protected]. b An Teallach Limited, Technology Transfer Centre, Kings Buildings, Ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.12.072